Right Coprime Factorizations for Single-input Descriptor Linear Systems: a Simple Numerically Stable Algorithm
نویسنده
چکیده
Based on the upper-triangular Hessenberg forms for descriptor linear systems and a method for right coprime factorization of descriptor linear systems using matrix elementary transformations, a simple, neat and numerically stable iterative formula for right coprime factorization of a regular singleinput descriptor linear system is proposed. This iterative formula gives directly the coefficients of the solutions to the coprime factorization of the system, and involves only multiplication and additions of non-negative scalar terms. Numerical examples are presented to demonstrate the proposed algorithm.
منابع مشابه
Generalized Schur Methods to Compute Coprime Factorizations of Rational Matrices
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices factorizations with least order denominators factorizations with inner denominators and factorizations with proper stable factors The new algorithms are based on a recursive generalized Schur algorithm for pole assignment They are generally applicable regardles...
متن کاملOn computing normalized coprime factorizations of periodic systems
A numerically reliable state space algorithm is proposed for computing normalized coprime factorizations of periodic descriptor systems. A preprocessing step is used in the algorithm to convert the initial problem for possibly non-causal systems into a simpler problem for causal periodic systems. The main computational ingredient here is the computation of a coprime factorization with causal fa...
متن کاملGeneralized Schur Methods to Computecoprime Factorizations of Rational Matricesa
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices: 1) factorizations with least order denominators; 2) factorizations with inner denominators; and 3) factorizations with proper stable factors. The new algorithms are based on a recursive generalized Schur algorithm for pole assignment. They are generally applic...
متن کاملComputation of Normalized Coprime Factorizations of Rational Matrices
We propose a new computational approach based on descriptor state space algorithms for computing normalized coprime factorizations of arbitrary rational matrices. The proposed approach applies to both continuousand discrete-time rational transfer-function matrices and shows that each rational matrix possesses a normalized coprime factorization with proper factors. The new method is conceptually...
متن کاملRecursive computation of coprime factorizations
We propose general computational procedures based on descriptor state-space realizations to compute coprime factorizations of rational matrices with minimum degree denominators. Enhanced recursive pole dislocation techniques are developed, which allow to successively place all poles of the factors into a given “good” domain of the complex plane. The resulting McMillan degree of the denominator ...
متن کامل